Search results for "benders cut"
showing 2 items of 2 documents
A decomposition approach for multidimensional knapsacks with family-split penalties
2022
The optimization of Multidimensional Knapsacks with Family-Split Penalties has been introduced in the literature as a variant of the more classical Multidimensional Knapsack and Multi-Knapsack problems. This problem deals with a set of items partitioned in families, and when a single item is picked to maximize the utility, then all items in its family must be picked. Items from the same family can be assigned to different knapsacks, and in this situation split penalties are paid. This problem arises in real applications in various fields. This paper proposes a new exact and fast algorithm based on a specific Combinatorial Benders Cuts scheme. An extensive experimental campaign computational…
Vehicle scheduling for rental-with-driver services
2021
Abstract In this paper, we introduce a new vehicle scheduling problem (VSP) with driver consistency faced by rental-with-driver companies. A weekly time-horizon is considered and a set of potential customers, each one associated with a list of required tasks, is assumed. The company can choose to accept or reject a customer, but if accepted, all required tasks must be performed by the same driver. A profit is associated with each customer. The goal is to maximize the company’s total profit, by respecting a list of daily and the weekly drivers’ workload limitations imposed by drivers’ contracts. We propose a mathematical formulation of the problem and design an exact solution method based on…